Description Logics with Transitive Roles

Decidability of Description Logics with Transitive Closure of Roles in Concept and Role Inclusion Axioms

This paper investigates Description Logics which allow transitive closure of roles to occur not only in concept inclusion axioms but also in role inclusion axioms. First, we propose a decision procedure for the description logic SHIO+, which is obtained from SHIO by adding transitive closure of roles. Next, we show that SHIO+ has the finite model property by providing a upper bound on the size ...

A Description Logic with Transitive and Inverse Roles and Role Hierarchies

The combination of transitive and inverse roles is important in a range of applications, and is crucial for the adequate representation of aggregated objects, allowing the simultaneous description of parts by means of the whole to which they belong and of wholes by means of their constituent parts. In this paper we present tableaux algorithms for deciding concept satisfiability and subsumption ...

On Query Answering in Description Logics with Number Restrictions on Transitive Roles

We study query answering in the description logic SQ supporting number restrictions on both transitive and non-transitive roles. Our main contributions are (i) a tree-like model property for SQ knowledge bases and, building upon this, (ii) an automata based decision procedure for answering two-way regular path queries, which gives a 3ExpTime upper bound.

Conjunctive Query Answering for Description Logics with Transitive Roles

An important reasoning task, in addition to the standard DL reasoning services, is conjunctive query answering. In this paper, we present algorithms for conjunctive query answering in the expressive Description Logics SHQ and SHOQ. In particular, we allow for transitive (or nonsimple) roles in the query body, which is a feature that is not supported by other existing conjunctive query answering...

Unification in a Description Logic with Transitive Closure of Roles

Computing Least Common Subsumers for FLE+

Transitive roles are important for adequate representation of knowledge in a range of applications. In this paper we present a first algorithm to compute least common subsumers in a description logic with transitive roles.